Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
نویسندگان
چکیده
منابع مشابه
Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
By operations onmodels we showhow to relate completenesswith respect to permissivenominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal models, so the construction hinges on generating from an instance of the latter, some instance of the former in which sufficiently many inequalities are preserved b...
متن کاملCompleteness and Herbrand theorems for nominal logic
Nominal logic is a variant of first-order logic in which abstract syntax with names and binding is formalized in terms of two basic operations: name-swapping and freshness. It relies on two important principles: equivariance (validity is preserved by name-swapping), and fresh name generation (“new” or fresh names can always be chosen). It is inspired by a particular class of models for abstract...
متن کاملCompleteness and Incompleteness in Nominal Kleene Algebra
Article history: Received 26 January 2016 Received in revised form 9 June 2017 Accepted 11 June 2017 Available online 16 June 2017
متن کاملNominal Algebra
Universal algebra [5, 9, 4] is the theory of equalities t = u. It is a simple framework within which we can study mathematical structures, for example groups, rings, and fields. It has also been applied to study the mathematical properties of mathematical truth and computability. For example boolean algebras correspond to classical truth, heyting algebras correspond to intuitionistic truth, cyl...
متن کاملClosed nominal rewriting and efficiently computable nominal algebra equality
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus and first-order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2012
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1344862164